Improved bounds for Erdős' Matching Conjecture
نویسنده
چکیده
Article history: Received 7 June 2012 Available online 24 February 2013
منابع مشابه
Distributed storage allocations and a hypergraph conjecture of Erdős
We study two variations of the distributed storage allocation problem. The goal is to allocate a given storage budget in a distributed storage system for maximum reliability. It was recently discovered that this problem is related to an old conjecture in extremal combinatorics, on the maximum number of edges in a hypergraph subject to a constraint on its maximum matching number. The conjecture ...
متن کاملFractional and integer matchings in uniform hypergraphs
A conjecture of Erdős from 1965 suggests the minimum number of edges in a kuniform hypergraph on n vertices which forces a matching of size t, where t ≤ n/k. Our main result verifies this conjecture asymptotically, for all t < 0.48n/k. This gives an approximate answer to a question of Huang, Loh and Sudakov, who proved the conjecture for t ≤ n/3k. As a consequence of our result, we extend bound...
متن کاملUnions of Perfect Matchings in Cubic Graphs and Implications of the Berge-Fulkerson Conjecture
The Berge-Fulkerson Conjecture states that every cubic bridgeless graph has six perfect matchings such that every edge of the graph is in exactly two of the perfect matchings. If the Berge-Fulkerson Conjecture is true, then what can we say about the proportion of edges of a cubic bridgeless graph that can be covered by k of its perfect matchings? This is the question we address in this paper. W...
متن کاملThe Picker-Chooser diameter game
Positional Games are played under several rules on the same hypergraph. We consider some intriguing connection among the outcome of the Maker-Breaker and the Picker-Chooser versions. The later ones were introduced by Beck in [5] and proved to be important in understanding Positional Games in general. Beck had the profound conjecture that playing on the same hypergraph, Picker has better chances...
متن کاملUpper Bounds for Erdös-Hajnal Coefficients of Tournaments
A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of ord...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 120 شماره
صفحات -
تاریخ انتشار 2013